#include <cstdio>
#include <map>
#include <queue>

using namespace std;

struct Node
{
    int x, y, z;
    Node( ) { }
    Node( int _x, int _y, int _z )
        : x( _x ), y( _y ), z( _z ) { }
};

bool operator < ( const Node &a, const Node &b )
{
    if ( a.x != b.x ) return a.x < b.x;
    if ( a.y != b.y ) return a.y < b.y;
    return a.z < b.z;
}

map<Node, bool> m;
queue<Node> q;

int main( )
{
    int i, j, k, cnt = 0, x, y, z;
    Node p;
    bool flag;
    char str[ 1010 ];
    while ( scanf("%s", str) != EOF )
    {
        flag = false;
        x = y = z = 0;
        for ( i = 0; str[ i ]; i++ )
        {
            if ( str[ i ] == 'j' )
            {
                flag = true;
                break;
            }
            if ( str[ i ] == 'z' )
                break;
            x++;
        }
        if ( flag || !str[ i ] )
        {
            puts("Wrong Answer");
            continue;
        }
        for ( i++; str[ i ]; i++ )
        {
            if ( str[ i ] == 'z' )
            {
                flag = true;
                break;
            }
            if ( str[ i ] == 'j' )
                break;
            y++;
        }
        if ( flag || !str[ i ] )
        {
            puts("Wrong Answer");
            continue;
        }
        for ( i++; str[ i ]; i++ )
        {
            if ( str[ i ] == 'z' || str[ i ] == 'j' )
            {
                flag = true;
                break;
            }
            z++;
        }
        if ( flag )
        {
            puts("Wrong Answer");
            continue;
        }
        if ( x * y == z && y != 0 )
            puts("Accepted");
        else
            puts("Wrong Answer");
    }
    return 0;
}
